Expected-Delay-Summing Weak Bisimilarity for Markov Automata
نویسندگان
چکیده
منابع مشابه
Expected-Delay-Summing Weak Bisimilarity for Markov Automata
A new weak bisimulation semantics is defined for Markov automata that, in addition to abstracting from internal actions, sums up the expected values of consecutive exponentially distributed delays possibly intertwined with internal actions. The resulting equivalence is shown to be a congruence with respect to parallel composition for Markov automata. Moreover, it turns out to be comparable with...
متن کاملQuotienting the Delay Monad by Weak Bisimilarity
The delay datatype was introduced by Capretta [2] as a means to incorporate general recursion to Martin-Löf type theory and it is useful in this setting for modeling non-terminating behaviours. This datatype is a (strong) monad and constitutes a constructive alternative to the maybe monad. For a given set X, each element of DX is a possibly infinite computation that returns a value of X, if it ...
متن کاملLate Weak Bisimulation for Markov Automata
Markov automata (MA) and weak bisimulation have been proposed by Eisentraut, Hermanns and Zhang in [10]. In this paper we propose early and late semantics of Markovian automata, and then introduce early and late weak bisimulations correspondingly. We show that early weak bisimulation coincides with the weak bisimulation in [10], and late weak bisimulation is strictly coarser. Further, we extend...
متن کاملWeak Bisimilarity Coalgebraically
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illustrate the usefulness of our approach by providing a fully-abstract denotational semantics for CCS under weak ...
متن کاملUndecidability of Weak Bisimilarity for PA-Processes
We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post’s correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.194.1